- theory of enumerations
- мат.теория перечислений
English-Russian scientific dictionary. 2008.
theory of enumerations
Смотреть что такое "theory of enumerations" в других словарях:
Enumeration — In mathematics and theoretical computer science, the broadest and most abstract definition of an enumeration of a set is an exact listing of all of its elements (perhaps with repetition). The restrictions imposed on the type of list used depend… … Wikipedia
Polyomino — The 18 one sided pentominoes, including 6 mirrored pairs … Wikipedia
C++11 — C++11, also formerly known as C++0x,[1] is the name of the most recent iteration of the C++ programming language, replacing C++TR1, approved by the ISO as of 12 August 2011.[2] The name is derived from the tradition of naming language versions by … Wikipedia
C++0x — is the planned new standard for the C++ programming language. It is intended to replace the existing C++ standard, ISO/IEC 14882, which was published in 1998 and updated in 2003. These predecessors are informally known as C++98 and C++03. The new … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Hermeneutics — Gadamer and Ricoeur G.B.Madison THE HISTORICAL BACKGROUND: ROMANTIC HERMENEUTICS Although the term ‘hermeneutics’ (hermeneutica) is, in its current usage, of early modern origin,1 the practice it refers to is as old as western civilization itself … History of philosophy
Data type — For other uses, see Data type (disambiguation). In computer programming, a data type is a classification identifying one of various types of data, such as floating point, integer, or Boolean, that determines the possible values for that type; the … Wikipedia
Church Statistics — Ecclesiastical Statistics † Catholic Encyclopedia ► Ecclesiastical Statistics In dealing with statistics, both theoretically and practically, it is unimportant whether the men, matters, or actions subject to observation are… … Catholic encyclopedia
Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… … Wikipedia
Ibn al-Nafis — Infobox Muslim scholars | notability = Muslim scholar| era = Islamic Golden Age| color = #cef2e0 | | image caption = Ibn al Nafis| | name = Ala al Din Abu al Hassan Ali ibn Abi Hazm al Qarshi al Dimashqi | title= Ibn al Nafis | birth = 1213 CE |… … Wikipedia
The Slavs — The Slavs † Catholic Encyclopedia ► The Slavs I. NAME A. Slavs At present the customary name for all the Slavonic races is Slav. This name did not appear in history until a late period, but it has superseded all others. The… … Catholic encyclopedia
